Cryptographic Primitives
نویسنده
چکیده
A symmetric or private-key cipher is one in which knowledge of the encryption key is explicitly or implicitly equivalent to knowing the decryption key. An asymmetric or public-key cipher is one in which the encryption key is effectively public knowledge, without giving any useful information about the decryption key. Until 30 years ago all ciphers were private-key. The very possibility of public-key crypto did not exist until the secret work Ellis-Cocks-Williamson at the UK's CESG-at-GCHQ in the 1960's, and public-domain work of Merkle, Diffie-Hellman, and Rivest-Shamir-Adleman in the 1970's. Even more significant than the secrecy achievable by public-key ciphers is the variety of effects achievable that were (and continue to be) simply impossible with even the best symmetric-key ciphers. Key exchange and signatures (authentication) are the most notable among well-established uses. Further examples are given in section 6. Other articles in address specific aspects of public-key cryptography at greater length. D. Lieman's article [Lie] concerns refinements of protocols appropriate to genuine practical implementations. N. Howgrave-Graham [HG] treats proofs of security. J. Silverman's [Sil3] discusses elliptic curves. W. Whyte's [Wh] and W.D. Banks' [Ba] articles consider the problem of designing faster cryptosystems of various sorts. And I. Shparlinski [Shp2] discusses design and attacks upon systems based upon various hidden-number problems. Given these, we will emphasize algorithms related mostly to RSA, primality testing, and factoring attacks, as opposed to discrete logs and/or elliptic curves, and give only simple naive forms of protocol-ideas rather than refined forms. By now there are many introductory texts on cryptography. Many of them are reviewed in [L3].
منابع مشابه
Lightweight 4x4 MDS Matrices for Hardware-Oriented Cryptographic Primitives
Linear diffusion layer is an important part of lightweight block ciphers and hash functions. This paper presents an efficient class of lightweight 4x4 MDS matrices such that the implementation cost of them and their corresponding inverses are equal. The main target of the paper is hardware oriented cryptographic primitives and the implementation cost is measured in terms of the required number ...
متن کاملCPA on COLM Authenticated Cipher and the Protection Using Domain-Oriented Masking
Authenticated encryption schemes are important cryptographic primitives that received extensive attention recently. They can provide both confidentiality and authenticity services, simultaneously. Correlation power analysis (CPA) can be a thread for authenticated ciphers, similar to the any physical implementation of any other cryptographic scheme. In this paper, a three-step CPA attack against...
متن کاملS ¸ Tefan Ciobâc˘ A, Véronique Cortier Protocol Composition for Arbitrary Primitives Protocol Composition for Arbitrary Primitives
We study the composition of security protocols when protocols share secrets such as keys. We show (in a Dolev-Yao model) that if two protocols use disjoint cryptographic primitives, their composition is secure if the individual protocols are secure, even if they share data. Our result holds for any cryptographic primitives that can be modeled using equational theories, such as encryption, signa...
متن کاملIs it possible to decide whether a cryptographic protocol is secure or not ?
We consider the so called “cryptographic protocols” whose aim is to ensure some security properties when communication channels are not reliable. Such protocols usually rely on cryptographic primitives. Even if it is assumed that the cryptographic primitives are perfect, the security goals may not be achieved: the protocol itself may have weaknesses which can be exploited by an attacker. We sur...
متن کاملOn Bitcoin Security in the Presence of Broken Crypto Primitives
Digital currencies like Bitcoin rely on cryptographic primitives to operate. However, past experience shows that cryptographic primitives do not last forever: increased computational power and advanced cryptanalysis cause primitives to break frequently, and motivate the development of new ones. It is therefore crucial for maintaining trust in a crypto currency to anticipate such breakage. We pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007